I/O Efficient Accepting Cycle Detection
نویسندگان
چکیده
We show how to adapt an existing non-DFS-based accepting cycle detection algorithm OWCTY [10, 15, 29] to the I/O efficient setting and compare its I/O efficiency and practical performance to the existing I/O efficient LTL model checking approach of Edelkamp and Jabbar [14]. The new algorithm exhibits similar I/O complexity with respect to the size of the graph while it avoids quadratic increase in the size of the graph. Therefore, the number of I/O operations performed is significantly lower and the algorithm exhibits better practical performance.
منابع مشابه
Ltl Model Checking with I/o-efficient Accepting Cycle Detection Ltl Model Checking with I/o-efficient Accepting Cycle Detection
We show how to adopt existing non-DFS-based algorithm OWCTY [ČP03] for accepting cycle detection to the I/O efficient setting and compare the I/O efficiency and practical performance of the adopted algorithm to the existing I/O efficient LTL model checking approach of Edelkamp et al. [EJ06]. We show that while the new algorithm exhibits similar I/O complexity with respect to the size of the gra...
متن کاملHow to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
Distributed automata-based LTL model-checking relies on algorithms for finding accepting cycles in a Büchi automaton. The approach to distributed accepting cycle detection as presented in [9] is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one of the main factors affecting the overall complexity of model-checking as an imperfect ordering ca...
متن کاملMultiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs
We revisit I/O-efficient solutions to a number of fundamental problems on planar graphs: single-source shortest paths, topological sorting, and computing strongly connected components. Existing I/O-efficient solutions to these problems pay for I/O efficiency using excessive computation time in internal memory, thereby completely negating the performance gain achieved by minimizing the number of...
متن کاملPdmc ’ 05
Enumerative distributed reachability analysis based on a simple partitioning of the state space has become a well known technique implemented in numerous model checking tools. The timed automata model checker UPPAAL is no exception to this rule, and for over 5 years a distributed version of UPPAAL has been used to analyse large timed automata models. In this talk we address two fundamental issu...
متن کاملDiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking
In this paper we present a tool that performs CUDA accelerated LTL Model Checking. The tool exploits parallel algorithm MAP adjusted to the NVIDIA CUDA architecture in order to efficiently detect the presence of accepting cycles in a directed graph. Accepting cycle detection is the core algorithmic procedure in automata-based LTL Model Checking. We demonstrate that the tool outperforms non-acce...
متن کامل